Justification by Infinite Loops
نویسندگان
چکیده
In an earlier paper we have shown that a proposition can have a welldefined probability value, even if its justification consists of an infinite linear chain. In the present paper we demonstrate that the same holds if the justification takes the form of a closed loop. Moreover, in the limit that the size of the loop tends to infinity, the probability value of the justified proposition is always welldefined, whereas this is not always so for the infinite linear chain. This suggests that infinitism sits more comfortably with a coherentist view of justification than with an approach in which justification is portrayed as a linear process.
منابع مشابه
Fractal Patterns in Reasoning
This paper is the third and final one in a sequence of three. All three papers emphasize that a proposition can be justified by an infinite regress, on condition that epistemic justification is interpreted probabilistically. The first two papers showed this for one-dimensional chains and for one-dimensional loops of propositions, each proposition being justified probabilistically by its precurs...
متن کاملAccelerating Interpolants
We present Counterexample-Guided Accelerated Abstraction Refinement (CEGAAR), a new algorithm for verifying infinite-state transition systems. CEGAAR combines interpolation-based predicate discovery in counterexampleguided predicate abstraction with acceleration technique for computing the transitive closure of loops. CEGAAR applies acceleration to dynamically discovered looping patterns in the...
متن کاملDetecting and Escaping Infinite Loops with Jolt
Infinite loops make applications unresponsive. Potential problems include lost work or output, denied access to application functionality, and a lack of responses to urgent events. We present Jolt, a novel system for dynamically detecting and escaping infinite loops. At the user’s request, Jolt attaches to an application to monitor its progress. Specifically, Jolt records the program state at t...
متن کاملAutomatic Repair of Infinite Loops
Research on automatic software repair is concerned with the development of systems that automatically detect and repair bugs. One well-known class of bugs is the infinite loop. Every computer programmer or user has, at least once, experienced this type of bug. We state the problem of repairing infinite loops in the context of test-suite based software repair: given a test suite with at least on...
متن کاملDealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domains with repetitions. Df-pn(r) cures it by ignoring proof and disproof numbers that may lead to infinite loops. This paper points out that df-pn(r) has a serious issue of underestimating proof and disproof numbers, while...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 51 شماره
صفحات -
تاریخ انتشار 2010